# 递归
def fibonacci(n):
    if n <= 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)


# 示例：打印前10个斐波那契数
for i in range(10):
    print(fibonacci(i))
